Fast matrix factorizations via discrete transmission lines
نویسندگان
چکیده
منابع مشابه
Collaborative Filtering via Ensembles of Matrix Factorizations
We present a Matrix Factorization (MF) based approach for the Netflix Prize competition. Currently MF based algorithms are popular and have proved successful for collaborative filtering tasks. For the Netflix Prize competition, we adopt three different types of MF algorithms: regularized MF, maximum margin MF and non-negative MF. Furthermore, for each MF algorithm, instead of selecting the opti...
متن کاملOn matrix factorizations for recursive pruned discrete cosine transforms
This paper presents two matrix factorizations for recursive pruned discrete cosine transforms. Both factorizations have lower computational complexity when compared to the method of El-Sharkawy and Eshmawy (1995). ( 1998 Elsevier Science B.V. All rights reserved.
متن کاملRiordan group approaches in matrix factorizations
In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.
متن کاملFast Spatial Gaussian Process Maximum Likelihood Estimation via Skeletonization Factorizations
Maximum likelihood estimation for parameter-fitting given observations from a Gaussian process in space is a computationally-demanding task that restricts the use of such methods to moderately-sized datasets. We present a framework for unstructured observations in two spatial dimensions that allows for evaluation of the log-likelihood and its gradient (i.e., the score equations) in Õpn3{2q time...
متن کاملEfficient Document Clustering via Online Nonnegative Matrix Factorizations
In recent years, Nonnegative Matrix Factorization (NMF) has received considerable interest from the data mining and information retrieval fields. NMF has been successfully applied in document clustering, image representation, and other domains. This study proposes an online NMF (ONMF) algorithm to efficiently handle very large-scale and/or streaming datasets. Unlike conventional NMF solutions w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1986
ISSN: 0024-3795
DOI: 10.1016/0024-3795(86)90178-3